Phase matching in quantum searching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Phase Matching in Quantum Searching

Each iteration in Grover’s original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation θ and the inversion for the prepared state |γ〉 is replaced by rotation through φ, we found that these phase rotations must satisfy a matching condition θ = φ. Approximate fo...

متن کامل

Searching for quantum software

Quantum computing has the potential to bring a new class of previously intractable problems within the reach of computer science. Harnessing the quantum mechanical phenomena of superposition and entanglement, a quantum computer can manipulate vast amounts of information in a single computational step and perform certain operations exponentially faster than classical (i.e. non-quantum) computers...

متن کامل

Quantum Searching Amidst Uncertainty

Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − ǫ, where ǫ is a random variable that is uniformly distributed in the range (0, ǫ0) .The problem is to try to select a marked item from the database in a single query. If the algorithm selects a marked item, it succeeds, else if...

متن کامل

Imperfect quantum searching algorithm

We point out that the criterion, derived by Long et al.[Phys. Rev A 61, 042305 (2000)], to judging the degree of inaccuracy under systematic errors in phase inversions in Grover’s quantum search algorithm is overestimated. Although this criterion is properly deduced, it lacks a more accurate characterization to the relation between systematic errors and the size of a quantum database. The crite...

متن کامل

Object Searching with Combination of Template Matching

Object searching is the identification of an object in an image or video. There are several approaches to object detection, including template matching in computer vision. Template matching uses a small image, or template, to find matching regions in a larger image. In this paper, we propose a robust object searching method based on adaptive combination template matching. We apply a partition s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Letters A

سال: 1999

ISSN: 0375-9601

DOI: 10.1016/s0375-9601(99)00631-3